Regularity Index of Uncertain Random Graph

A graph containing some edges with probability measures and other uncertain is referred to as an random graph. Numerous real-world problems in social networks transportation can be boiled down optimization graphs. Actually, information graphs always asymmetric. Regularization a common problem theory, the regularity index fundamentally measurable indicator of Therefore, this paper investigates within framework chance theory asymmetry theory. The concepts k-regularity are first presented on basis Then, order compute graph, simple straightforward calculating approach discussed. Furthermore, we discuss relationship between Additionally, adjacency matrix-based algorithm that provided. Some specific examples given illustrate proposed method algorithm. Finally, conclude by highlighting potential applications networks, well future vision its combination symmetry.